Shotgun assembly of Erdős-Rényi random graphs
نویسندگان
چکیده
Graph shotgun assembly refers to the problem of reconstructing a graph from collection local neighborhoods. In this paper, we consider Erdős–Rényi random graphs G(n,pn), where pn=n−α for 0<α<1. We both reconstruction up isomorphism as well exact (recovering vertex labels structure). show that given distance-1 neighborhoods, G is exactly reconstructable 0<α<1 3, but not 1 2<α<1. Given distance-2 α∈0,1 2∪1 2,3 5, 3 4<α<1.
منابع مشابه
Erdős - Rényi Random Graphs + Forest Fires = Self - Organized Criticality
We modify the usual Erd˝ os-Rényi random graph evolution by letting connected clusters 'burn down' (i.e. fall apart to disconnected single sites) due to a Poisson flow of lightnings. In a range of the intensity of rate of lightnings the system sticks to a permanent critical state. The authors thank the anonymous referee for thoroughly reading the manuscript. Her/his comments and suggestions hel...
متن کاملOn asymptotically exact probability of $k$-connectivity in random key graphs intersecting Erdős-Rényi graphs
Random key graphs have originally been introduced in the context of a random key predistribution scheme for securing wireless sensor networks (WSNs). Since then, they have appeared in applications spanning recommender systems, social networks, clustering and classification analysis, and cryptanalysis of hash functions. Random key graphs, denoted G(n;K,P ), form a class of random intersection gr...
متن کاملConnectivity of inhomogeneous random key graphs intersecting inhomogeneous Erdős-Rényi graphs
We study the connectivity of a random graph formed by the intersection of an inhomogeneous random key graph with an inhomogeneous Erdős-Rényi graph. The former graph is naturally induced by a heterogeneous random key predistribution scheme introduced for securing wireless sensor network communications. In this scheme, nodes are divided into r classes according to a probability distribution μ = ...
متن کاملModeling interest-based social networks: Superimposing Erdős-Rényi graphs over random intersection graphs
There is a recent rise of interest-based social networks (e.g., Pinterest and Goodreads), which connect users by relations based on shared interests. In these networks, links between users manifest from selecting common interests from a pool of available interests. For example, two users may establish a link on Pinterest because of both liking dog photos, or on Goodreads due to reading the same...
متن کاملErdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs
Given a finite group G by its multiplication table as input, we give a deterministic polynomial-time construction of a directed Cayley graph on G with O(log |G|) generators, which has a rapid mixing property and a constant spectral expansion. We prove a similar result in the undirected case, and give a new deterministic polynomialtime construction of an expanding Cayley graph with O(log |G|) ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2022
ISSN: ['1083-589X']
DOI: https://doi.org/10.1214/22-ecp445